Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
نویسندگان
چکیده
LetD = (V (D), A(D)) be a digraph. The competition graph ofD, is the graphwith vertex set V (D) and edge set {uv ∈ ( V (D) 2 ) : ∃w ∈ V (D), uw, vw ∈ A(D)}. The double competition graph of D, is the graph with vertex set V (D) and edge set {uv ∈ ( V (D) 2 )
منابع مشابه
Poset , competition numbers , and interval graph ∗
Let D = (V (D), A(D)) be a digraph. The competition graph of D, is the graph with vertex set V (D) and edge set {uv ∈ `V (D) 2 ́ : ∃w ∈ V (D),−→ uw,−→ vw ∈ A(D)}. The double competition graph of D, is the graph with vertex set V (D) and edge set {uv ∈ `V (D) 2 ́ : ∃w1, w2 ∈ V (D),−−→ uw1,−−→ vw1,−−→ w2u,−−→ w2v ∈ A(D)}. A poset of dimension at most two is a digraph whose vertices are some points ...
متن کاملPii: S0012-365x(98)00309-4
With a finite graph G = (V,E), we associate a partially ordered set P = (X, P) with X = V U E and x < e in P if and only if x is an endpoint of e in G. This poset is called the incidence poset of G. In this paper, we consider the function M ( p , d ) defined for p, d~>2 as the maximum number of edges a graph G can have when it has p vertices and the dimension of its incidence poset is at most d...
متن کاملThe maximum number of edges in a graph of bounded dimension, with applications to ring theory
With a nite graph G V E we associate a partially ordered set P X P with X V E and x e in P if and only if x is an endpoint of e in G This poset is called the incidence poset of G In this paper we consider the function M p d de ned for p d as the maximum number of edges a graph G can have when it has p vertices and the dimension of its incidence poset is at most d It is easy to see that M p p as...
متن کاملComplete Valuations on Finite Distributive Lattices
We characterize the finite distributive lattices which admit a complete valuation, that is bijective over a set of consecutive natural numbers, with the additional conditions of completeness (Definition 2.3). We prove that such lattices are downset lattices of finite posets of dimension at most two, and determine a realizer through a recursive relation between weights on the poset associated to...
متن کاملTrees and circle orders
This paper continues a recent resurgence of interest in combinatorial properties of a poset that are associated with graph properties of its cover graph and order diagram. The following two theorems appearing in a 1977 paper of Trotter and Moore have played important roles in motivating this more modern research: (1) The dimension of a poset is at most 3 when its cover graph is at tree; (2) The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 158 شماره
صفحات -
تاریخ انتشار 2010